#include <bits/stdc++.h>

#define eb emplace_back
#define ep emplace
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 1e5 + 10;

db ib[N], a[N], b[N], r[N], f[N];
int n;

struct line {
	db k, b;
	line(db _k = 0, db _b = -1e9) : k(_k), b(_b) {}
	db operator [](int x) { return ib[x] * k + b; }
} val[N << 2];

void ins(int o, line v, int l = 1, int r = n) {
	int mid = l + r >> 1; if(val[o][mid] < v[mid]) swap(v, val[o]); if(l == r) return;
	if(val[o][l] < v[l]) ins(o << 1, v, l, mid);
	if(val[o][r] < v[r]) ins(o << 1 | 1, v, mid + 1, r);
}

db query(int o, int pos, int l = 1, int r = n) {
	int mid = l + r >> 1; db ans = val[o][pos]; if(l == r) return ans;
	if(pos <= mid) chkmax(ans, query(o << 1, pos, l, mid)); else chkmax(ans, query(o << 1 | 1, pos, mid + 1, r));
	return ans;
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("1.in", "r", stdin);
#endif
	scanf("%d %lf", &n, &f[0]); rep(i, 1, n) scanf("%lf %lf %lf", &a[i], &b[i], &r[i]), ib[i] = 1. * a[i] / b[i];
	sort(ib + 1, ib + n + 1); 
	rep(i, 1, n) {
		db A = a[i], B = b[i], R = r[i];
		f[i] = f[i - 1]; ins(1, line(f[i] * R / (A * R + B), f[i] / (A * R + B)));
		chkmax(f[i], query(1, lower_bound(ib + 1, ib + n + 1, 1. * A / B) - ib) * B);
		ins(1, line(f[i] * R / (A * R + B), f[i] / (A * R + B)));
	} printf("%.3lf\n", f[n]);
	return 0;
}
